Intuitionistic implication makes model checking hard
نویسندگان
چکیده
منابع مشابه
Intuitionistic implication makes model checking hard
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic FPL, and Jankov’s logic KC. We show that the model checking problem is P-complete for the implicational fragments of all these intuitionistic log...
متن کاملIntuitionistic implication without disjunction
We investigate fragments of intuitionistic propositional logic containing implication but not disjunction. These fragments are finite, but their size grows superexponentially with the number of generators. Exact models are used to characterize the fragments.
متن کاملLinearizing Intuitionistic Implication
An embedding of the implicational propositional intuitionistic logic (iil) into the nonmodal fragment of intuitionistic linear logic (imall) is given. The embedding preserves cut-free proofs in a proof system that is a variant of iil. The embedding is eecient and provides an alternative proof of the pspace-hardness of imall. It exploits several proof-theoretic properties of intuitionistic impli...
متن کاملIntuitionistic Implication and Resolution
Some recent works rely on the intuitionistic theory of Hereditary Harrop formulas to provide extensions for Horn clauses while preserving the logic paradigm. In particular, an intuitionistic implication is used to provide some form of scoping. However the lack of appropriate evaluation strategies, notably a strategy relying on a forward-chaining search, has limited its application. This paper i...
متن کاملModel Checking CTL+ and FCTL is Hard
Among the branching-time temporal logics used for the specification and verification of systems, CTL, FCTL and ECTL are the most notable logics for which the precise computational complexity of model checking is not known. We answer this longstanding open problem and show that model checking these (and some related) logics is ∆ p 2-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2012
ISSN: 1860-5974
DOI: 10.2168/lmcs-8(2:3)2012